package 盛最多水的容器;

class Solution {
    public int maxArea(int[] height) {
        int left = 0;
        int right = height.length - 1;
        int ret = 0;
        while (left != right){
            int v = Math.min(height[left],height[right]) * (right - left);
            ret = Math.max(ret,v);
            if (height[left] < height[right]){
                left++;
            }else {
                right--;
            }
        }
        return ret;
    }
}